Fast radio broadcasting with advice
نویسندگان
چکیده
منابع مشابه
Fast Radio Broadcasting with Advice
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be availabl...
متن کاملFast Broadcasting and Gossiping in Radio Networks
We establish an O(n log2 n) upper bound on the time for deterministic distributed broadcasting in multi-hop radio networks with unknown topology. This nearly matches the known lower bound of (n logn). The fastest previously known algorithm for this problem works in time O(n3=2). Using our broadcasting algorithm, we develop an O(n3=2 log2 n) algorithm for gossiping in the same network model.
متن کاملRadio Broadcasting
The AM Signalling System (AMSS), now a published ETSI standard [2], has been designed within the DRM Coding and Multiplexing (DRM-CM) group. It uses low bitrate phase modulation of the AM carrier to add a small amount of digital information to existing analogue AM broadcasts on short-, mediumand long-wave, giving similar functionality to that provided by the Radio Data System (RDS) on the FM ba...
متن کاملFast Rendezvous with Advice
Two mobile agents (robots), starting from different nodes of an n-node network at possibly different times, have to meet at the same node. This problem is known as rendezvous. Agents move in synchronous rounds using a deterministic algorithm. In each round, an agent decides to either remain idle or to move to one of the adjacent nodes. Each agent has a distinct integer label from the set {1, . ...
متن کاملFast Broadcasting with Byzantine Faults
We construct and analyze a fast broadcasting algorithm working in the presence of Byzantine component faults. Such faults are particularly difficult to deal with, as faulty components may behave arbitrarily (even maliciously) as transmitters, by either blocking, rerouting, or altering transmitted messages in a way most detrimental to the broadcasting process. We assume that links and nodes of a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.01.004